On Waiting for Simultaneous Access to Two Resources

نویسندگان

  • Michael L. Honig
  • Teunis J. Ott
چکیده

This paper studies the M /G/1 queue where a special (test) customer can get service only if he has simultaneous access to the server and a second resource. All other customers only need access to the server. The second resource becomes available after an exponentially distributed amount of time. The ordinary customers are served according to the FIFO discipline. The test customer has the freedom to leave his place in the queue at any time and join the end of the queue. If he reaches the server before the second resource becomes available, he then must return to the back of the queue. We derive the waiting time distribution of the test customer given that he always maintains his position in the queue until he reaches the server. A number of conditions are given under which this "move-along" policy is optimal, i.e., minimizes the test customer’s mean delay until service. These conditions depend on the amount of information and freedom of action available to the test customer.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Waiting for Simultaneous Access to Two Resources: Deterministic Service Distribution

A correction is given to a proof of the fact, presented in apaper by Roesser 111, that every partitioned matrix A not only satisfies thetwodimensional Characteristic equation, butitmust also satisfy an Manuscript received June 30, 1986.The author is with the Instytut Matematyki, Politechnika Biafostocka, Bidystok, IEEE Log Number 8714289.Poland. OO18-9286/87/11OO-1025$01...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Data Management for Multiuser Access to Digital Video Libraries

To support heterogeneous application types a video digital library will contain a large number of video objects with various lengths and display requirements. Multi-user access to the same video objects is required in order to increase the availability of video information and to make full use of the limited computing and storage resources. The access frequency and delay sensitivity of video ob...

متن کامل

Improving Data Grids Performance by Using Modified Dynamic Hierarchical Replication Strategy

Abstract: A Data Grid connects a collection of geographically distributed computational and storage resources that enables users to share data and other resources. Data replication, a technique much discussed by Data Grid researchers in recent years creates multiple copies of file and places them in various locations to shorten file access times. In this paper, a dynamic data replication strate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 14  شماره 

صفحات  -

تاریخ انتشار 1989